1 Non - Newtonian AI for solving NP - complete problems

نویسنده

  • Michail Zak
چکیده

A new kind of dynamics for simulations based upon quantum-classical hybrid is discussed. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen potentials. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for quantuminspired information processing. In this paper, the retrieval of stored items from an exponentially large unsorted database is performed by quantum-inspired resonance using polynomial resources due to quantum-like superposition effect.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving PPPP-Complete Problems Using Knowledge Compilation

Knowledge compilation has been successfully used to solve beyond NP problems, including some PP-complete and NP-complete problems for Bayesian networks. In this work we show how knowledge compilation can be used to solve problems in the more intractable complexity class PP. This class contains NP and includes interesting AI problems, such as non-myopic value of information. We show how to solve...

متن کامل

The International SAT Solver Competitions

is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...

متن کامل

Graph Search and Strips Planning

AI is founded upon that belief that intelligence is based on computation. It seems likely that a deep understanding of computation will prove useful in the investigation of intelligence. In any computational process eeciency is desirable. This chapter continues the investigation of techniques for improving the eeciency of computations that search. The theory of computation provides a framework ...

متن کامل

Testing Credulous and Sceptical Acceptance in Small-World Networks

In this paper we test how efficiently state-of-the art solvers are capable of solving credulous and sceptical argument-acceptance for lower-order extensions. As our benchmark we consider two different random graph-models to obtain random Abstract Argumentation Frameworks with small-world characteristics: Kleinberg and Watt-Strogatz. We test two reasoners, i.e., ConArg2 and dynPARTIX, on such be...

متن کامل

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016